279 research outputs found
On the Stability of Random Multiple Access with Stochastic Energy Harvesting
In this paper, we consider the random access of nodes having energy
harvesting capability and a battery to store the harvested energy. Each node
attempts to transmit the head-of-line packet in the queue if its battery is
nonempty. The packet and energy arrivals into the queue and the battery are all
modeled as a discrete-time stochastic process. The main contribution of this
paper is the exact characterization of the stability region of the packet
queues given the energy harvesting rates when a pair of nodes are randomly
accessing a common channel having multipacket reception (MPR) capability. The
channel with MPR capability is a generalized form of the wireless channel
modeling which allows probabilistic receptions of the simultaneously
transmitted packets. The results obtained in this paper are fairly general as
the cases with unlimited energy for transmissions both with the collision
channel and the channel with MPR capability can be derived from ours as special
cases. Furthermore, we study the impact of the finiteness of the batteries on
the achievable stability region.Comment: The material in this paper was presented in part at the IEEE
International Symposium on Information Theory, Saint Petersburg, Russia, Aug.
201
Channel-Aware Random Access in the Presence of Channel Estimation Errors
In this work, we consider the random access of nodes adapting their
transmission probability based on the local channel state information (CSI) in
a decentralized manner, which is called CARA. The CSI is not directly available
to each node but estimated with some errors in our scenario. Thus, the impact
of imperfect CSI on the performance of CARA is our main concern. Specifically,
an exact stability analysis is carried out when a pair of bursty sources are
competing for a common receiver and, thereby, have interdependent services. The
analysis also takes into account the compound effects of the multipacket
reception (MPR) capability at the receiver. The contributions in this paper are
twofold: first, we obtain the exact stability region of CARA in the presence of
channel estimation errors; such an assessment is necessary as the errors in
channel estimation are inevitable in the practical situation. Secondly, we
compare the performance of CARA to that achieved by the class of stationary
scheduling policies that make decisions in a centralized manner based on the
CSI feedback. It is shown that the stability region of CARA is not necessarily
a subset of that of centralized schedulers as the MPR capability improves.Comment: The material in this paper was presented in part at the IEEE
International Symposium on Information Theory, Cambridge, MA, USA, July 201
Subspace Methods for Data Attack on State Estimation: A Data Driven Approach
Data attacks on state estimation modify part of system measurements such that
the tempered measurements cause incorrect system state estimates. Attack
techniques proposed in the literature often require detailed knowledge of
system parameters. Such information is difficult to acquire in practice. The
subspace methods presented in this paper, on the other hand, learn the system
operating subspace from measurements and launch attacks accordingly. Conditions
for the existence of an unobservable subspace attack are obtained under the
full and partial measurement models. Using the estimated system subspace, two
attack strategies are presented. The first strategy aims to affect the system
state directly by hiding the attack vector in the system subspace. The second
strategy misleads the bad data detection mechanism so that data not under
attack are removed. Performance of these attacks are evaluated using the IEEE
14-bus network and the IEEE 118-bus network.Comment: 12 page
Ultra Wideband Impulse Radio Systems with Multiple Pulse Types
In an ultra wideband (UWB) impulse radio (IR) system, a number of pulses,
each transmitted in an interval called a "frame", is employed to represent one
information symbol. Conventionally, a single type of UWB pulse is used in all
frames of all users. In this paper, IR systems with multiple types of UWB
pulses are considered, where different types of pulses can be used in different
frames by different users. Both stored-reference (SR) and transmitted-reference
(TR) systems are considered. First, the spectral properties of a multi-pulse IR
system with polarity randomization is investigated. It is shown that the
average power spectral density is the average of the spectral contents of
different pulse shapes. Then, approximate closed-form expressions for the bit
error probability of a multi-pulse SR-IR system are derived for RAKE receivers
in asynchronous multiuser environments. The effects of both inter-frame
interference (IFI) and multiple-access interference (MAI) are analyzed. The
theoretical and simulation results indicate that SR-IR systems that are more
robust against IFI and MAI than a "conventional" SR-IR system can be designed
with multiple types of ultra-wideband pulses. Finally, extensions to
multi-pulse TR-IR systems are briefly described.Comment: To appear in the IEEE Journal on Selected Areas in Communications -
Special Issue on Ultrawideband Wireless Communications: Theory and
Application
Deriving Good LDPC Convolutional Codes from LDPC Block Codes
Low-density parity-check (LDPC) convolutional codes are capable of achieving
excellent performance with low encoding and decoding complexity. In this paper
we discuss several graph-cover-based methods for deriving families of
time-invariant and time-varying LDPC convolutional codes from LDPC block codes
and show how earlier proposed LDPC convolutional code constructions can be
presented within this framework. Some of the constructed convolutional codes
significantly outperform the underlying LDPC block codes. We investigate some
possible reasons for this "convolutional gain," and we also discuss the ---
mostly moderate --- decoder cost increase that is incurred by going from LDPC
block to LDPC convolutional codes.Comment: Submitted to IEEE Transactions on Information Theory, April 2010;
revised August 2010, revised November 2010 (essentially final version).
(Besides many small changes, the first and second revised versions contain
corrected entries in Tables I and II.
Variations on a theme by Schalkwijk and Kailath
Schalkwijk and Kailath (1966) developed a class of block codes for Gaussian
channels with ideal feedback for which the probability of decoding error
decreases as a second-order exponent in block length for rates below capacity.
This well-known but surprising result is explained and simply derived here in
terms of a result by Elias (1956) concerning the minimum mean-square distortion
achievable in transmitting a single Gaussian random variable over multiple uses
of the same Gaussian channel. A simple modification of the Schalkwijk-Kailath
scheme is then shown to have an error probability that decreases with an
exponential order which is linearly increasing with block length. In the
infinite bandwidth limit, this scheme produces zero error probability using
bounded expected energy at all rates below capacity. A lower bound on error
probability for the finite bandwidth case is then derived in which the error
probability decreases with an exponential order which is linearly increasing in
block length at the same rate as the upper bound.Comment: 18 Pages, 4 figures (added reference
Performance Evaluation of Impulse Radio UWB Systems with Pulse-Based Polarity Randomization
In this paper, the performance of a binary phase shift keyed random
time-hopping impulse radio system with pulse-based polarity randomization is
analyzed. Transmission over frequency-selective channels is considered and the
effects of inter-frame interference and multiple access interference on the
performance of a generic Rake receiver are investigated for both synchronous
and asynchronous systems. Closed form (approximate) expressions for the
probability of error that are valid for various Rake combining schemes are
derived. The asynchronous system is modelled as a chip-synchronous system with
uniformly distributed timing jitter for the transmitted pulses of interfering
users. This model allows the analytical technique developed for the synchronous
case to be extended to the asynchronous case. An approximate closed-form
expression for the probability of bit error, expressed in terms of the
autocorrelation function of the transmitted pulse, is derived for the
asynchronous case. Then, transmission over an additive white Gaussian noise
channel is studied as a special case, and the effects of multiple-access
interference is investigated for both synchronous and asynchronous systems. The
analysis shows that the chip-synchronous assumption can result in
over-estimating the error probability, and the degree of over-estimation mainly
depends on the autocorrelation function of the ultra-wideband pulse and the
signal-to-interference-plus-noise-ratio of the system. Simulations studies
support the approximate analysis.Comment: To appear in the IEEE Transactions on Signal Processin
Emergent Behaviors over Signed Random Dynamical Networks: State-Flipping Model
Recent studies from social, biological, and engineering network systems have
drawn attention to the dynamics over signed networks, where each link is
associated with a positive/negative sign indicating trustful/mistrustful,
activator/inhibitor, or secure/malicious interactions. We study asymptotic
dynamical patterns that emerge among a set of nodes that interact in a
dynamically evolving signed random network. Node interactions take place at
random on a sequence of deterministic signed graphs. Each node receives
positive or negative recommendations from its neighbors depending on the sign
of the interaction arcs, and updates its state accordingly. Recommendations
along a positive arc follow the standard consensus update. As in the work by
Altafini, negative recommendations use an update where the sign of the neighbor
state is flipped. Nodes may weight positive and negative recommendations
differently, and random processes are introduced to model the time-varying
attention that nodes pay to these recommendations. Conditions for almost sure
convergence and divergence of the node states are established. We show that
under this so-called state-flipping model, all links contribute to a consensus
of the absolute values of the nodes, even under switching sign patterns and
dynamically changing environment. A no-survivor property is established,
indicating that every node state diverges almost surely if the maximum network
state diverges.Comment: IEEE Transactions on Control of Network Systems, in press. arXiv
admin note: substantial text overlap with arXiv:1309.548
- …